Lecture 6 : The Elias - Bassalygo Bound
نویسنده
چکیده
We currently know the following four bounds on rate as a function of relative distance, three of them upper bounds (which tell us what rate-distance combinations are impossible), and one lower bound (which tells us what rate-distance combinations we can achieve). In the following, R is the rate and δ the relative distance of a code. For example, a (n, k, d) code has R = k/n and δ = d/n. Hq(x) is the q-ary entropy function, Hq(x) = x logq ( (q − 1)/x ) + (1− x) logq ( 1/(1− x) ) .
منابع مشابه
3 Elias-bassalygo Theorem
Problem Set 1 is due next Wednesday. 2 Overview Today we will do the following. • Prove the Elias-Bassalygo-Johnson Bound introduced in the previous lecture. Recall that the proof consists of the two lemmas described roughly below – List decodable codes have poor rate. – Good error correcting codes are nicely decodable. • Introduce some algebraic codes along with some helpful idea from algebra....
متن کاملInduced Weights on Quotient Modules and an Application to Error Correction in Coherent Networks
We consider distance functions on a quotient module M/K induced by distance functions on a module M. We define error-correction for codes in M/K with respect to induced distance functions. For the case that the metric is induced by a homogeneous weight, we derive analogues of the Plotkin and Elias-Bassalygo bounds and give their asymptotic versions. These results have applications to coherent n...
متن کاملEnd-to-End Error-Correcting Codes on Networks with Worst-Case Symbol Errors
The problem of coding for networks experiencing worst-case symbol errors is considered. We argue that this is a reasonable model for highly dynamic wireless network transmissions. We demonstrate that in this setup prior network error-correcting schemes can be arbitrarily far from achieving the optimal network throughput. A new transform metric for errors under the considered model is proposed. ...
متن کاملReflections on “Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes”
A t-error-correcting code over a q-ary alphabet Fq is a set C ⊆ Fq such that for any received vector r ∈ Fq there is at most one vector c ∈ C that lies within a Hamming distance of t from r. The minimum distance of the code C is the minimum Hamming distance between any pair of distinct vectors c1, c2 ∈ C. In his seminal work introducing these concepts, Hamming pointed out that a code of minimum...
متن کاملA class of Artinian local rings of homogeneous type
Let $I$ be an ideal in a regular local ring $(R,n)$, we will find bounds on the first and the last Betti numbers of $(A,m)=(R/I,n/I)$. if $A$ is an Artinian ring of the embedding codimension $h$, $I$ has the initial degree $t$ and $mu(m^t)=1$, we call $A$ a {it $t-$extended stretched local ring}. This class of local rings is a natural generalization of the class of stretched ...
متن کامل